Split Euler tours in 4-regular planar graphs
نویسندگان
چکیده
منابع مشابه
Split Euler tours in 4-regular planar graphs
The construction of a homing tour is known to be NP-complete. On the other hand, the Euler formula puts sufficient restrictions on plane graphs that one should be able to assert the existence of such tours in some cases; in particular we focus on split Euler tours (SETs) in 3-connected, 4-regular, planar graphs (tfps). An Euler tour S in a graph G is a SET if there is a vertex v (called a half ...
متن کاملEnumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...
متن کاملCounting Euler Tours in Undirected Bounded Treewidth Graphs
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel by proving a GapL ⊆ NC ⊆ P upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main technical contribution is to show how (an instance of) dynamic programming on bounded clique-width graphs can be performed efficiently in parallel. Thus we show...
متن کاملTopological Circles and Euler Tours in Locally Finite Graphs
We obtain three results concerning the topological cycle space C of a locally finite connected graph G. Confirming a conjecture of Diestel we show that through every edge set E ∈ C there is a topological Euler tour, a continuous map from the circle S to the end compactification |G| of G that traverses every edge in E exactly once and traverses no other edge. Second, we show that for every seque...
متن کاملA lower bound for 4-regular planar unit distance graphs
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2016
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1836